Computing a Glimpse of Randomness

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing a Glimpse of Randomness

A Chaitin Omega number is the halting probability of a universal Chaitin (selfdelimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computable, increasing, converging sequence of rationals) and random (its binary expansion is an algorithmic random sequence). In particular, every Omega number is strongly non-computable. The aim of this paper is to describe ...

متن کامل

COMPUTING SCIENCE Randomness as a Resource

This reprint is provided for personal and noncommercial use. For any other use, please send a request to Permissions,

متن کامل

Distributed Computing with Imperfect Randomness

Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solutions to these tasks assume access to a source of unbiased, independent coins. Physical sources of randomness, on the other hand, are rarely unbiased and independent although they do seem to exhibit somewhat imperfect...

متن کامل

Opposition versus randomness in soft computing techniques

For many soft computing methods, we need to generate random numbers to use either as initial estimates or during the learning and search process. Recently, results for evolutionary algorithms, reinforcement learning and neural networks have been reported which indicate that the simultaneous consideration of randomness and opposition is more advantageous than pure randomness. This new scheme, ca...

متن کامل

Techniques for computing with low-independence randomness

During the past two decades, randomness has emerged as a central tool in the development of computational procedures. For example, there are many well known problems for which randomness can be used to design an algorithm that works well with high probability on all inputs, whereas the best known deterministic algorithms fail miserably on worst-case inputs. Unfortunately, generating truly rando...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2002

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2002.10504481